Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
نویسندگان
چکیده
منابع مشابه
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-known MAP/G/1 queue by allowing dependencies between interarrival and service times. The waiting time process is directly analyzed by solving Lindley’s equation by transform methods. The Laplace Stieltjes transforms (LST)...
متن کاملA Single-Server Queue with Markov Modulated Service Times
We study a queueing system with a Poisson arrival process and Markov modulated, exponential service requirements. For a modulating Markov Chain with two states, we show that the distribution of the number-in-system is a superposition of two matrix-geometric series and provide a simple algorithm for computing the rate and coefficient matrices. These results hold for both finite and infinite wait...
متن کاملSingle Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...
متن کاملTwo-parameter Process Limits for an Infinite-server Queue with Arrival Dependent Service Times
We study an infinite-server queue with a general arrival process and a large class of general time-varying service time distributions. Specifically, customers’ service times are conditionally independent given their arrival times, and each customer’s service time, conditional on her arrival time, has a general distribution function. We prove functional limit theorems for the two-parameter proce...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2003
ISSN: 0257-0130
DOI: 10.1023/a:1026093622185